Scheduling sports competitions with a given distribution of times
نویسندگان
چکیده
منابع مشابه
Scheduling sports competitions at multiple venues - Revisited
In this work, we study scheduling sports competitions at multiple venues, a problem recently introduced by Urban and Russell [T.L. Urban, R.A. Russell, Scheduling sports competitions on multiple venues, European Journal of Operational Research 148 (2003) 302–311]. The distinguishing feature of the problem is that venues come into play when scheduling. We develop beam search and simulated anneal...
متن کاملStopping times with given laws
Given a stochastic process Xt, t b T CR, and s ~ R, then a) iff b): a) For every probability measure p on there is a stopping time T for Xt with law L(T) = p: b) If At is the smallest a-algebra for which Xu are measurable for all u ~ t, then P restricted to At is nonatomic for all t > s. This note began with a question of G. Shiryaev, connected with the following example. Let Wt be a standard W...
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملA Mathematical Model for a Flow Shop Scheduling Problem with Fuzzy Processing Times
This paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. In the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). However,, two significant criteria for each schedule in stochastic models are: expectable m...
متن کاملA three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1988
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90119-9